On geometric recurrence for time-inhomogeneous autoregression

نویسندگان

چکیده

The time-inhomogeneous autoregressive model AR(1) is studied, which the process of form ${X_{n+1}}={\alpha _{n}}{X_{n}}+{\varepsilon _{n}}$, where ${\alpha _{n}}$ are constants, and ${\varepsilon independent random variables. Conditions on distributions established that guarantee geometric recurrence process. This result applied to estimate stability n-steps transition probabilities for two processes ${X^{(1)}}$ ${X^{(2)}}$ assuming both _{n}^{(i)}}$, $i\in \{1,2\}$, close enough.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Continuous time Gaussian Autoregression

The problem of tting continuous time autoregressions linear and non linear to closely and regularly spaced data is considered For the linear case Jones and Bergstrom used state space representations to compute exact maximum likelihood estimators and Phillips did so by tting an appropriate discrete time ARMA process to the data In this paper we use exact conditional maximum likelihood estimators...

متن کامل

Bootstrap Percolation on Geometric Inhomogeneous Random Graphs

Geometric inhomogeneous random graphs (GIRGs) are a model for scale-free networks with underlying geometry. We study bootstrap percolation on these graphs, which is a process modelling the spread of an infection of vertices starting within a (small) local region. We show that the process exhibits a phase transition in terms of the initial infection rate in this region. We determine the speed of...

متن کامل

Geometric Inhomogeneous Random Graphs

For the theoretical study of real-world networks, we propose a model of scale-free randomgraphs with underlying geometry that we call geometric inhomogeneous random graphs (GIRGs).GIRGs generalize hyperbolic random graphs, which are a popular model to test algorithms forsocial and technological networks. Our generalization overcomes some limitations of hyperbolicrandom graphs, w...

متن کامل

Sampling Geometric Inhomogeneous Random Graphs in Linear Time

Real-world networks, like social networks or the internet infrastructure, have structural properties such as large clustering coefficients that can best be described in terms of an underlying geometry. This is why the focus of the literature on theoretical models for real-world networks shifted from classic models without geometry, such as Chung-Lu random graphs, to modern geometry-based models...

متن کامل

On Bayesian analysis of non-linear continuous-time autoregression models

This paper introduces a method for performing fully Bayesian inference for non-linear conditional autoregressive continuous-time models, based on a finite skeleton of observations. Our approach uses MCMC and involves imputing data from times at which observations are not made. It uses a reparameterisation technique for the missing data, and due to the non-Markovian nature of the models, it is n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Modern stochastics: theory and applications

سال: 2023

ISSN: ['2351-6046', '2351-6054']

DOI: https://doi.org/10.15559/23-vmsta228